منابع مشابه
Nondeterministic Stochastic Differential Dynamic Logic
Complex hybrid systems can have several sources of uncertainty. Uncontrollable events that change the state of the system and can be triggered unpredictably or adversarially are typically modelled as nondeterministic whereas events to which we can attribute some likelihood, either because of their fundamental nature or because of simplifying assumptions, are typically modelled as stochastic. Al...
متن کاملNondeterministic Programming in Java with JSetL
In this paper, we show how nondeterministic programming techniques can be used within the Java programming language. Our proposal is to stay within a library-based approach but taking advantage of the (nondeterministic) constraint solver provided by the library JSetL to give the user the possibility to define its own nondeterministic code as new constraints. We also point out the potential syne...
متن کاملInvocat A nondeterministic generative programming language
We present the design and implementation of a probabilistic, nondeterministic programming language called Invocat for defining and generating from context-free grammars. We define Invocat’s lexical, concrete, and abstract syntaxes as well as its operational semantics. We implement the language in Lua as a lexical analyzer, parser, and interpreter.
متن کاملHierarchical Generation of Dynamic and Nondeterministic Quests
Quests are a fundamental storytelling mechanism used by computer role-playing games to engage players in the game’s narrative. Although role-playing games have evolved in many different ways in the last years, their basic narrative structure is still based on static plots manually created by game designers. In this paper, we present a method for the generation of dynamic quests based on hierarc...
متن کاملNote on Practical Dynamic Programming
Since we convert the original sequential problem into a collection of small problems, it is important to make sure that the solution to each of the small problems is actually optimal in the original problem. In other words, the optimal choice in each of the two-period problem must be globally optimal to justify the transformation. Richard Bellman, the inventor of the dynamic programming method,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 2008
ISSN: 0286-522X
DOI: 10.5109/18991